Relations Between Varieties of Kolmogorov Complexities
نویسندگان
چکیده
منابع مشابه
Inequalities for Shannon entropies and Kolmogorov complexities
The paper investigates connections between linear inequalities that are valid for Shannon entropies and for Kolmogorov complexities.
متن کاملKolmogorov complexities Kmax, Kmin on computable partially ordered sets
We introduce a machine free mathematical framework to get a natural formalization of some general notions of infinite computation in the context of Kolmogorov complexity. Namely, the classes MaxX→D PR and MaxX→D Rec of functions X→ D which are pointwise maximum of partial or total computable sequences of functions where D = (D,<) is some computable partially ordered set. The enumeration theorem...
متن کاملVandermonde Varieties and Relations among Schur Polynomials
Motivated by the famous Skolem-Mahler-Lech theorem we initiate in this paper the study of a natural class of determinantal varieties which we call Vandermonde varieties. They are closely related to the varieties consisting of all linear recurrence relations of a given order possessing a non-trivial solution vanishing at a given set of integers. In the regular case, i.e., when the dimension of a...
متن کاملGreen's-Like Relations on Algebras and Varieties
There are five equivalence relations known as Green’s relations definable on any semigroup or monoid, that is, on any algebra with a binary operation which is associative. In this paper, we examine whether Green’s relations can be defined on algebras of any type τ . Some sort of superassociativity is needed for such definitions to work, and we consider algebras which are clones of terms of type...
متن کاملRelationships Between Nondeterministic and Deterministic Tape Complexities
This paper first proves the Savitch Theorem: any nondeterminstic L(n)− tape bounded Turing Machine can be simulated by a deterministic [L(n)]− tape bounded Turing machine, provided L(n) ≥ log2n. Then as an attempt to answer the following question: “Given a nondeterministic tape bounded Turing machine which accepts set A, how much additional storage does a deterministic Turing machine require to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Systems Theory
سال: 1996
ISSN: 0025-5661
DOI: 10.1007/s002240000015